Distributed Model Checking: From Abstract Algorithms to Concrete Implementations

Distributed Model Checking (Dmc) is based on several distributed algorithms, which are often complex and error prone. In this paper, we consider one fundamental aspect of Dmc design: message passing communication, the implementation of which presents hidden tradeoffs often dismissed in Dmc related literature. We show that, due to such communication models, high level abstract Dmc algorithms might face implicit pitfalls when implemented concretely. We illustrate our discussion with a generic distributed state space generation algorithm.